the project portfolio selection and scheduling problem: mathematical model and algorithms

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialist competitive algorithm, simulated annealing and genetic algorithm are developed to solve such a hard problem. the proposed algorithms employ advanced operators. the performance of the proposed algorithms is numerically evaluated. the results show the high performance of the imperialist competitive algorithm outperforms the other algorithms.